#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 45;

int n, h;
__int128_t dp[N][N];

void solve() {
  cin >> n >> h;
  rep(i, 0, n) dp[0][i] = 1;
  rep(i, 1, n) rep(j, 1, n) {
    rep(k, 1, i) { dp[i][j] += dp[k - 1][j - 1] * dp[i - k][j - 1]; }
  }
  ll ans = dp[n][n] - dp[n][h - 1];
  cout << ans << endl;
  return;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  t = 1;
  while (t--) solve();
  return 0;
}